A Criterion and Schemes on the Random Oracle Model
نویسندگان
چکیده
A study of the random oracle model seems to be concentrated to showing the gap between the schemes in the random oracle model and the schemes whose random oracles are replaced with functions chosen at random from some function ensembles. We consider a different direction on the study of the schemes in the random oracle model. We focus on the size of the tables necessary to describe all of the entries to be potentially queried in the random oracle model. We show how to reduce the table sizes of the schemes for encryption and signature in the random oracle model. In particular, we apply this idea to PSS-R and OAEP and show the security of our schemes.
منابع مشابه
An efficient certificateless signcryption scheme in the standard model
Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...
متن کاملA secure instantiation of the random oracle by a computable function
In this paper we investigate the problem of secure instantiation of the random oracle, based on the concepts and methods of algorithmic randomness. We show that, for any secure signature scheme in the random oracle model, there exists a specific computable function which can instantiate the random oracle while keeping the security originally proved in the random oracle model. Our results use th...
متن کاملRing Signature and Identity-Based Ring Signature from Lattice Basis Delegation
In this paper, we propose a set of ring signature (RS) schemes and identity-based ring signature (IBRS) schemes using the lattice basis delegation technique due to [10,22]. The schemes are unforgeable and hold anonymity in the random oracle model. Using the method in [28,29], we also extend our constructions to obtain RS and IBRS schemes in the standard model. Our proposed ring signature scheme...
متن کاملProvably Secure Partially Blind Signature Scheme Based on Quadratic Residue
Partially blind signature schemes are the most important ingredient for anonymity in off-line e-cash system. In this paper, a new approach to setup formal security arguments in random oracle model for factorization based partially blind signature schemes is presented. Then a provably secure and efficient scheme based on quadratic residue is proposed. The approach also allows one to give formal ...
متن کاملRandom Oracle Reducibility
We discuss a reduction notion relating the random oracles in two cryptographic schemes A and B. Basically, the random oracle of scheme B reduces to the one of scheme A if any hash function instantiation of the random oracle (possibly still oracle based) which makes A secure also makes B secure. In a sense, instantiating the random oracle in scheme B is thus not more demanding than the one for s...
متن کامل